How useful are preemptive schedules?
نویسندگان
چکیده
Machine scheduling admits two options to process jobs. In a preemptive mode processing may be interrupted and resumed later even on a different machine. In a nonpreemptive mode interruptions are not allowed. Usually, the possibility to preempt jobs leads to better performance values. However, also examples exist where preemptions do not improve the performance. This paper gives an overview of existing and new results on this topic for single and parallel machine scheduling problems.
منابع مشابه
List Scheduling in Order of α-Points on a Single Machine
Many approximation results for single machine scheduling problems rely on the conversion of preemptive schedules into (preemptive or non-preemptive) solutions. The initial preemptive schedule is usually an optimal solution to a combinatorial relaxation or a linear programming relaxation of the scheduling problem under consideration. It therefore provides a lower bound on the optimal objective f...
متن کاملRandom-Based Scheduling: New Approximations and LP Lower Bounds
Three characteristics encountered frequently in real-world machine scheduling are jobs released over time, precedence constraints between jobs, and average performance optimization. The general constrained one-machine scheduling problem to minimize the average weighted completion time not only captures these features, but also is an important building block for more complex problems involving m...
متن کاملComposable Preemptive and Non-preemptive Real-time Scheduling Eliminating Component Overhead
Our work required a model for scheduling real-time tasks that extended the state of the art, supporting a flexible mix of preemptive and non-preemptive scheduling. Mixing these two kinds of scheduling is useful because preemption permits flexible allocation of CPU time while nonpreemptive scheduling has many benefits in software engineering (since race conditions become much more difficult to c...
متن کاملPreemptive Scheduling for Distributed Systems
Preemptive scheduling is widespread in operating systems and in parallel processing on symmetric multiprocessors. However, in distributed systems it is practically unheard of. Scheduling in distributed systems is an important issue, and has performance impact on parallel processing, load balancing and metacomputing. Non-preemptive scheduling can perform well if the task lengths and processor sp...
متن کاملPreemptive Task Scheduling for Distributed Systems
Task scheduling in a preemptive runtime environment has potential advantages over the non-preemptive case such as better processor utilization and more flexibility when scheduling tasks. Furthermore, preemptive approaches may need less runtime support (e.g. no task ordering required). In contrast to the non-preemptive case, preemptive task scheduling in a distributed system has not received muc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 31 شماره
صفحات -
تاریخ انتشار 2003